SPECTRA -a Maple library for solving linear matrix inequalities in exact arithmetic
نویسندگان
چکیده
This document briefly describes our freely distributed Maple library spectra, for Semidefinite Programming solved Exactly with Computational Tools of Real Algebra. It solves linear matrix inequalities in exact arithmetic and it is targeted to small-size, possibly degenerate problems for which symbolic infeasibility or feasibility certificates are required.
منابع مشابه
Global least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کاملIntegrating High-Performance Polynomial Arithmetic into Maple
With the need of achieving high performance on practical problems, computer algebra systems devote more and more effort on implementation techniques. This phenomenon is certainly accentuated by the democratization of parallel architectures (multicores) and other hardware accelerating technologies. In this report, we describe the integration of a C library offering highly optimized routines for ...
متن کاملOn the solving of matrix equation of Sylvester type
A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...
متن کاملDense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages
In the past two decades, some major efforts have been made to reduce exact (e.g. integer, rational, polynomial) linear algebra problems to matrix multiplication in order to provide algorithms with optimal asymptotic complexity. To provide efficient implementations of such algorithms one need to be careful with the underlying arithmetic. It is well known that modular techniques such as the Chine...
متن کاملCertified Diophantine Solving of Linear Systems in LinBox
LinBox[6] is a C++ template library for high-performance exact linear algebra. It provides optimized facilities for solving rational systems, and computing invariants and canonical forms of linear operators. It acts as middleware on top of existing low-level software libraries for multiprecision integer arithmetic (GMP, NTL), finite field algebra (Givaro, NTL) and linear algebra (BLAS, ATLAS). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1611.01947 شماره
صفحات -
تاریخ انتشار 2016